Encoding CSP into CCS
نویسندگان
چکیده
منابع مشابه
Encoding CSP into CCS
We study encodings from CSP into asynchronous CCS with name passing and matching, so in fact, the asynchronous π-calculus. By doing so, we discuss two different ways to map the multi-way synchronisation mechanism of CSP into the two-way synchronisation mechanism of CCS. Both encodings satisfy the criteria of Gorla except for compositionality, as both use an additional top-level context. Followi...
متن کاملEncoding CSP into CCS (Extended Version)
We study encodings from CSP into asynchronous CCS with name passing and matching, so in fact, the asynchronous π-calculus. By doing so, we discuss two different ways to map the multi-way synchronisation mechanism of CSP into the two-way synchronisation mechanism of CCS. Both encodings satisfy the criteria of Gorla except for compositionality, as both use an additional top-level context. Followi...
متن کاملOn the Relationship of CCS and CSP
This paper compares two models of concurrency, Milner's Calculus of Communicating Systems (CCS) and the failures model of Communicating Sequential Processes (CSP) developed by Hoare, Brookes and Roscoe. By adapting Milner's synchronisation trees to serve as notation for both CCS and CSP, we are able to define a representation mapping for CSP processes. We define an equivalence relation on synch...
متن کاملThe Extended Literal Encoding of SAT into CSP
We introduce the “extended literal” encoding of SAT into CSP. This is the first encoding which is “propagation-optimal”. That is, propagation using the standard search algorithm MAC in the CSP encoding performs the same search as Davis Putnam on the original SAT instance, and does so in the same worst case time complexity. We provide theoretical analysis of the encoding and a sample implementation
متن کاملThe Log-Support Encoding of CSP into SAT
Various encodings have been proposed to convert Constraint Satisfaction Problems (CSP) into Boolean Satisfiability problems (SAT). Some of them use a logical variable for each element in each domain: among these very successful are the direct and the support encodings. Other methods, such as the log-encoding, use a logarithmic number of logical variables to encode domains. However, they lack th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2015
ISSN: 2075-2180
DOI: 10.4204/eptcs.190.5